#pragma GCC optimize(2)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <vector>

using namespace std;
using LL = long long;

/*用进制的思想思考问题
因为题目中给出w的范围是 [1, 1000000]
则可以划分为三段 [1, 99] , [100, 9900], [10000, 990000] 来进行拼凑
*/
int main(){
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << 298 << '\n';
    for(int i = 1; i <= 99; i ++) cout << i << " ";
    for(int i = 1; i <= 99; i ++) cout << i * 100 << " ";
    for(int i = 1; i <= 99; i ++) cout << i * 10000 << " ";
    cout << 1000000 << " ";


    return 0;
}